The equivalence of zero span and zero semispan

نویسندگان

چکیده

منابع مشابه

Equivalence and Stooge Strategies in Zero - Sum

Classes of two-person zero-sum games termed "equivalent games" are defined. These are games with identical value and identical optimal mixed-strategies but with different matrix entries and thus different opportunities for exploiting a nonrational opponent. An experiment was conducted to investigate the strategy-choice behavior of subjects playing pairs of these "equivalent games." Also investi...

متن کامل

An Equivalence Between Zero Knowledge and Commitments

We show that a language in NP has a zero-knowledge protocol if and only if the language has an “instance-dependent” commitment scheme. An instance-dependent commitment schemes for a given language is a commitment scheme that can depend on an instance of the language, and where the hiding and binding properties are required to hold only on the YES and NO instances of the language, respectively. ...

متن کامل

THE ZERO-DIVISOR GRAPH OF A MODULE

Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for Γ(RM). We Will show that Γ(RM) is connected withdiam Γ(RM)≤ 3 and if Γ(RM) contains a cycle, then Γ(RM)≤4. We will also show tha...

متن کامل

The equivalence of linear programs and zero-sum games

In 1951, Dantzig showed the equivalence of linear programming problems and two-person zerosum games. However, in the description of his reduction from linear programs to zero-sum games, he noted that there was one case in which the reduction does not work. This also led to incomplete proofs of the relationship between the Minimax Theorem of game theory and the Strong Duality Theorem of linear p...

متن کامل

ORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS

Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1984

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1984-0722431-3